A Full Program Control Flow Representation for Real Programs
نویسندگان
چکیده
This paper reports on constructing an exhaustive full program control ow framework for precise data ow analysis of real programs. We discuss the problem of ambiguous calling relations in the presence of function pointers. A ow insensitive analysis is suggested and implemented for real C programs.
منابع مشابه
Real World Modeling and Nonlinear Control of an Electrohydraulic Driven Clutch
In this paper, a complete model of an electro hydraulic driven dry clutch along with its performance evaluation has elucidated. Through precision modeling, a complete nonlinear physical and full order sketch of clutch has drawn. Ultimate nonlinearities existent in the system prohibits it from being controlled by conventional linear control algorithms and to compensate the behavior of the sy...
متن کاملA Framework for Tracking Branch Conditions ( Extended
“Real world” programs are mostly written in procedural languages such as C, Pascal, Fortran, Modula, etc. The control flow graph is probably the most adequate, useful, and generic model for programs in procedural languages. The operational approach based of control flow graphs has been utilized in most compilers for analyzing programs in imperative languages. This approach assumes that environm...
متن کاملOptimal Power Flow in the Smart Grid Using Direct Load Control Program
This paper proposes an Optimal Power Flow (OPF) algorithm by Direct Load Control (DLC) programs to optimize the operational cost of smart grids considering various scenarios based on different constraints. The cost function includes active power production cost of available power sources and a novel flexible load curtailment cost associated with DLC programs. The load curtailment cost is based ...
متن کاملInformation Flow Control for Java Based on Path Conditions in Dependence Graphs
Language-based information flow control (IFC) is a powerful tool to discover security leaks in software. Most current IFC approaches are however based on nonstandard type systems. Type-based IFC is elegant, but not precise and can lead to false alarms. We present a more precise approach to IFC which exploits active research in static program analysis. Our IFC approach is based on path condition...
متن کاملDynamic Branch Resolution Based on Combined Static Analyses
Static analysis requires the full knowledge of the overall program structure. The structure of a program can be represented by a Control Flow Graph (cfg) where vertices are basic blocks (bb) and edges represent the control flow between the bb. To construct a full cfg, all the bb as well as all of their possible targets addresses must be found. In this paper, we present a method to resolve dynam...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997